Optimierung Und Kontrolle Projektbereich Diskrete Optimierung Three Easy Special Cases of the Euclidean Travelling Salesman Problem Three Easy Special Cases of the Euclidean Travelling Salesman Problem
نویسنده
چکیده
It is known that in case the distance matrix in the Travelling Salesman Problem (TSP) fulllls certain combinatorial conditions (e.g. the Demidenko conditions , the Kalmanson conditions or the Supnick conditions) then the TSP is solvable in polynomial time. This paper deals with the problem of recognizing Euclidean instances of the TSP for which there is a renumbering of the cities such that the corresponding renumbered distance matrix fulllls the Demidenko (Kalmanson, Supnick) conditions. We provide polynomial time recognition algorithms for all three cases.
منابع مشابه
Optimierung Und Kontrolle Projektbereich Diskrete Optimierung on the Tsp with a Relaxed General Distribution Matrix on the Traveling Salesman Problem with a Relaxed Monge Matrix
We show that the traveling salesman problem with a symmetric relaxed Monge matrix as distance matrix is pyramidally solvable and can thus be solved by dynamic programming. Furthermore, we present a polynomial time algorithm that decides whether there exists a renumbering of the cities such that the resulting distance matrix becomes a relaxed Monge matrix.
متن کاملOn the x-and-y-axes travelling salesman problem
This paper deals with a special case of the Euclidean Travelling Salesman Problem known as the x-and-y-axes TSP. In this special case, all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system for the Euclidean plane. We show that the problem can be solved in O(n) time.
متن کاملPhase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps consisting of clustered nodes. Uniform random sampling methods do not result in maps where the nodes are spread out to form identifiable clusters. To improve upon this, we propose an evolutionary algorithm that uses the layout of n...
متن کاملVariable-order Perturbation to Approximate Optimal Tours
Various existing techniques are discussed and combined to form a compound algorithm for the heuristic solution of large Travelling Salesman Problems. Improvements are then offered for two of its key components; one for general use and one for the Euclidean special case.
متن کاملThe x-and-y-axes travelling salesman problem
The x-and-y-axes travelling salesman problem forms a special case of the Euclidean TSP, where all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system of the Euclidean plane. By carefully analyzing the underlying combinatorial and geometric structures, we show that this problem can be solved in polynomial time. The running time of the resulting algorithm is qua...
متن کامل